Exact algorithms for dominating induced matching based on graph partition
نویسندگان
چکیده
منابع مشابه
Exact Algorithms for Dominating Induced Matching Based on Graph Partition
A dominating induced matching, also called an efficient edge domination, of a graph G = (V,E) with n = |V | vertices andm = |E| edges is a subset F ⊆ E of edges in the graph such that no two edges in F share a common endpoint and each edge in E\F is incident with exactly one edge in F . It is NP-hard to decide whether a graph admits a dominating induced matching or not. In this paper, we design...
متن کاملExact algorithms for dominating induced matchings
Say that an edge of a graph G dominates itself and every other edge adjacent to it. An edge dominating set of a graph G = (V,E) is a subset of edges E′ ⊆ E which dominates all edges of G. In particular, if every edge of G is dominated by exactly one edge of E′ then E′ is a dominating induced matching. It is known that not every graph admits a dominating induced matching, while the problem to de...
متن کاملExact Algorithms for Dominating Clique Problems
We handle in this paper three dominating clique problems, namely, the decision problem itself when one asks if there exists a dominating clique in a graph G and two optimization versions where one asks for a maximumand a minimum-size dominating clique, if any. For the three problems we propose optimal algorithms with provably worst-case upper bounds improving existing ones by (D. Kratsch and M....
متن کاملThe RW2 Algorithm for Exact Graph Matching
The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be used to match the nodes in two isomorphic graphs. However, the algorithm may suffer from the presence of colliding signatures in the same graph, which may prevent the procedure from finding the complete mapping between ...
متن کاملExact Probabilistic Inference for Inexact Graph Matching
Inexact graph matching is a fundamental problem in computer vision applications. It crops up whenever a correspondence between two structures must be determined in the presence of structural and attribute noise. Despite the importance of the problem, graph matching techniques in computer vision tend to be extremely task specific, and sometimes lack the power a general approach would have. For e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2015
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.04.012